- skolem function
- функция сколема
English-Russian dictionary of computer science. 2015.
skolem function
Смотреть что такое "skolem function" в других словарях:
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Skolem's paradox — is the mathematical fact that every countable axiomatisation of set theory in first order logic, if consistent, has a model that is countable, even if it is possible to prove, from those same axioms, the existence of sets that are not countable.… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… … Wikipedia
Thoralf Skolem — Infobox Scientist name = Thoralf Skolem birth date = birth date|1887|5|23|mf=y birth place = Sandsvaer, Buskerud, Norway residence = nationality = death date = death date and age|1963|3|23|1887|5|23|mf=y death place = Oslo, Norway field =… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Domain of a function — Venn diagram showing f, a function from domain X to codomain Y. The smaller oval inside Y is the image of f, sometimes called the range of f. In mathematics, the domain of definition or simply the domain of a function is the set of input or… … Wikipedia
Forme Normale De Skolem — Skolémisation En logique mathématique, la skolémisation d une formule du calcul des prédicats est une transformation de cette formule, qui, dans le cas d une forme prénexe, consiste à éliminer toutes les occurrences de quantificateur existentiel… … Wikipédia en Français
Forme normale de Skolem — Skolémisation En logique mathématique, la skolémisation d une formule du calcul des prédicats est une transformation de cette formule, qui, dans le cas d une forme prénexe, consiste à éliminer toutes les occurrences de quantificateur existentiel… … Wikipédia en Français
Forme normale de skolem — Skolémisation En logique mathématique, la skolémisation d une formule du calcul des prédicats est une transformation de cette formule, qui, dans le cas d une forme prénexe, consiste à éliminer toutes les occurrences de quantificateur existentiel… … Wikipédia en Français
recursive function — ▪ mathematics in logic and mathematics, a type of function or expression predicating some concept or property of one or more variables, which is specified by a procedure that yields values or instances of that function by repeatedly… … Universalium
